probFD

python2.7 ../probfd-qcomp19/builds/release64/bin/translate/translate.py domain.pddl p10.pddl
../probfd-qcomp19/builds/release64/bin/downward --sas output.sas --engine fretpi-hdp --heuristic hmax --enable-caching --epsilon 1e-6

Parsing...
Parsing: [0.010s CPU, 0.012s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.001s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.013s wall-clock]
Preparing model... [0.000s CPU, 0.006s wall-clock]
Generated 445 rules.
Computing model... [0.070s CPU, 0.060s wall-clock]
1499 relevant atoms
7780 auxiliary atoms
9279 final queue length
11484 total queue pushes
Completing instantiation... [0.060s CPU, 0.054s wall-clock]
Instantiating: [0.150s CPU, 0.136s wall-clock]
Computing fact groups...
Finding invariants...
8 initial candidates
Finding invariants: [0.000s CPU, 0.006s wall-clock]
Checking invariant weight... [0.000s CPU, 0.000s wall-clock]
Instantiating groups... [0.000s CPU, 0.000s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
Choosing groups...
38 uncovered facts
Choosing groups: [0.000s CPU, 0.000s wall-clock]
Building translation key... [0.000s CPU, 0.000s wall-clock]
Computing fact groups: [0.000s CPU, 0.007s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.000s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.000s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.000s CPU, 0.002s wall-clock]
Translating task: [0.040s CPU, 0.041s wall-clock]
1172 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
1 propositions removed
Detecting unreachable propositions: [0.020s CPU, 0.017s wall-clock]
Reordering and filtering variables...
39 of 40 variables necessary.
0 of 2 mutex groups necessary.
1092 of 1092 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.010s CPU, 0.006s wall-clock]
Translator variables: 39
Translator derived variables: 0
Translator facts: 82
Translator goal facts: 2
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 1092
Translator axioms: 0
Translator task size: 7753
Translator peak memory: 28528 KB
Writing output... [0.000s CPU, 0.007s wall-clock]
Done! [0.230s CPU, 0.227s wall-clock]	

Warning: :constants specification not allowed here (cf. PDDL BNF)	

reading input... [t=2.8596e-05s]
done reading input! [t=0.00129635s]
variables: 39
goals: 2
actions: 1092
axioms: 0
has conditional effects: 0
reconstructing probabilistic actions... [t=0.00130563s]
done reconstructing probabilistic actions! [t=0.00276532s]
probabilistic actions: 523 (with 1138 outcomes)
constructing successor generator... [t=0.00283064s]
done constructing successor generator! [t=0.00290971s]
Bytes per state: 8
Property: MaxProb
Preparing hmax dead end detection heuristic... [t=0.00292227s]
hmax initialization done! [t=0.00307936s]
Engine: FRET-pi with HDP
Starting trap elimination heuristic search wrapper...
Initial state reward: 0.6070900235045061377
Expansions: 214
Registered states: 499
Generated states: 902
Cached transitions: 355
Expansion cache hits: 10761
Transition cache hits: 18822
Approximate transition cache memory usage: 26KB
Solver time: 0.005061905000000000224s
Total time: 0.008155169000000000307s